Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
نویسندگان
چکیده
منابع مشابه
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Article history: Received 17 August 2009 Received in revised form 13 February 2010 Accepted 24 March 2010 Available online 27 March 2010
متن کاملHybrid tractability of constraint satisfaction problems with global constraints
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or intensionally, whether by an equation, propositional logic formula, or other means. Intensionally represented constraints, known as g...
متن کاملHarnessing Tractability in Constraint Satisfaction Problems
The Constraint Satisfaction Problem (CSP) is a fundamental problem in computer science that takes as input a finite set of variables, a finite set of values and a set of constraints, which are arbitrary relations imposed on certain subsets of variables. The goal is to find an assignment of values to variables that satisfies every constraint. The generality of CSP and its connections to logic, u...
متن کاملConstraint Satisfaction with Probabilistic Preferences on Variable Values Constraint Satisfaction with Probabilistic Preferences on Variable Values
Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we provide a formal model of constraint satisfa...
متن کاملGeneralizing Variable Elimination in Bayesian Networks
This paper describes a generalized version of the variable elimination algorithm for Bayesian networks. Variable elimination computes the marginal probability for some specified set of variables in a network. The algorithm consists of a single pass through a list of data structures called buckets. The generalization presented here adds a second pass to the algorithm and produces the marginal pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.03.002